Comments on Mohr and Henderson's Path Consistency Algorithm
نویسندگان
چکیده
Mohr and Henderson have presented new algorithms for arc and path consistency in [1]. Though the underlying ideas of their algorithms are correct, the path consistency algorithm PC-3 is in error. In this paper we point out the errors in this algorithm and give a correct one. The time complexity and space complexity of the revised algorithm are also analyzed.
منابع مشابه
Arc and Path Consistency Revisited
ARC AND PATH CONSISTENCY REVISITED' Roger Mohr and Thomas C. Henderson 2 CRIN BP 239 54506 Vandoeuvre (France)
متن کاملAn Optimal k-Consistency Algorithm
This paper generalizes the arc-consistency algorithm of Mohr and Henderson [4] and the pathconsistency algorithm of Han and Lee [2] to a k-consistency algorithm (arc-consistency and path-consistency being 2-consistency and 3-consistency, respectively). The algorithm is a development of Freuder's synthesis algorithm [1]. It simultaneously establishes i-consistency for each 1 <~ i <~ k. It has wo...
متن کاملEfficient Path Consistency Algorithms for Constraint Satisfaction Problems
A large number of problems can be formulated as special cases of the Constraint Satisfaction Problem (CSP). In such a problem, the task specification can be formulated to consist of a set of variables, a domain for each variable and a set of constraints on these variables. A typical task is then to find an instantiation of these variables (to values in their respective domains) such that all th...
متن کاملMaking Path Consistency Stronger for SAT *
We are dealing with the problem of enforcing certain level of consistency in Boolean satisfaction problems (SAT problems). As a starting point we took path-consistency which we made stronger by requiring a more restrictive condition on paths connecting consistent pairs of values. Unfortunately, we found that enforcing such a modified path-consistency is an NP-complete problem. However, the defi...
متن کاملDynamic Path Consistency for Interval-based Temporal Reasoning
Path consistency is an important component of the resolution method needed to check for the consistency of an Allen’s Interval-based temporal network. While this local consistency algorithm reduces, in general, the size of the search space before applying the backtrack search, it implies the consistency of the problem for some specific temporal networks. Our goal in this paper is to maintain th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Artif. Intell.
دوره 36 شماره
صفحات -
تاریخ انتشار 1988